Fast Numerical Nonlinear Fourier Transforms
نویسندگان
چکیده
منابع مشابه
Numerical stability of nonequispaced fast Fourier transforms
This paper presents some new results on numerical stability for multivariate fast Fourier transform of nonequispaced data (NFFT). In contrast to fast Fourier transform (of equispaced data), the NFFT is an approximate algorithm. In a worst case study, we show that both approximation error and roundoff error have a strong influence on the numerical stability of NFFT. Numerical tests confirm the t...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملDimensionless Fast Fourier Transforms
This paper shows that there are fast Fourier transform (FFT) algorithms that work, for a fixed number of points, independent of the dimension. Changing the dimension is achieved by relabeling the input and the output and changing the “twiddle factors.” An important consequence of this result, is that a program designed to compute the 1-dimensional Fourier transform can be easily modified to com...
متن کاملFast algorithms for fractional Fourier transforms
The fractional Fourier transform (FRFT) is a one-parametric generalization of the classical Fourier transform. The FRFT was introduced in the 80th and has found a lot of applications and is now used widely in signal processing. Both the space and the spatial frequency domains, respectively, are special cases of the fractional Fourier domains. They correspond to the 0th and 1st fractional Fourie...
متن کاملFast Algorithms for the Hypercomplex Fourier Transforms
In multi-dimensional signal processing the Cliiord Fourier transform (CFT or in the 2-D case: quater-nionic Fourier transform/QFT) is a consequent extension of the complex valued Fourier transform. Hence, we need a fast algorithm in order to compute the transform in practical applications. Since the CFT is based on a corresponding Cliiord algebra (CA) and CAs are not commutative in general, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2015.2485944